Garuda - Garba Rujukan Digital

MAJORIZATION TYPE INEQUALITIES VIA GREEN FUNCTION AND HERMITE'S POLYNOMIAL Khan, M. Adil; Latif, N.; Pecaric, J.
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.251.1-25

The Hermite polynomial and Green function are used to constructthe identities related to majorization type inequalities for convex function. By usingÂ Cebysev functional the bounds for the new identities are found to develop the Gruss and Ostrowski type inequalities. Further more exponential convexity together with Cauchy means is presented for linear functionals associated with the obtained inequalities.DOI : http://dx.doi.org/10.22342/jims.22.1.251.1-25

COMPLEMENTARY DISTANCE SPECTRA AND COMPLEMENTARY DISTANCE ENERGY OF LINE GRAPHS OF REGULAR GRAPHS Ramane, Harishchandra S.; Nandeesh, K.C.
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.205.27-35

The complementary distance (CD) matrix of a graph $G$ is defined as $CD(G) = [c_{ij}]$, where $c_{ij} = 1+D-d_{ij}$ if $i \neq j$ and $c_{ij} = 0$, otherwise, where $D$ is the diameter of $G$ and $d_{ij}$ is the distance between the vertices $v_i$ and $v_j$ in $G$. The $CD$-energy of $G$ is defined as the sum of the absolute values of the eigenvalues of $CD$-matrix. Two graphs are said to be $CD$-equienergetic if they have same $CD$-energy. In this paper we show that the complement of the line graph of certain regular graphs has exactly one positive $CD$-eigenvalue. Further we obtain the $CD$-energy of line graphs of certain regualr graphs and thus constructs pairs of $CD$-equienergetic graphs of same order and having different $CD$-eigenvalues.DOI :Â http://dx.doi.org/10.22342/jims.22.1.205.27-35

A DYNAMICAL SYSTEM APPROACH IN MODELING TECHNOLOGY TRANSFER Husniah, Hennie; Sebrina, Sebrina; Supriatna, A. K.
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.212.37-59

In this paper we discuss a mathematical model of two parties technology transfer from a leader to a follower. The model is reconstructed via dynamical system approach from a known standard Raz and Assa model and we found some important conclusion which have not been discussed in the original model. The model assumes that in the absence of technology transfer from a leader to a follower, both the leader and the follower have a capability to grow independently with a known upper limit of the development. We obtain a rich mathematical structure of the steady state solution of the model. We discuss a special situation in which the upper limit of the technological development of the follower is higher than that of the leader, but the leader has started earlier than the follower in implementing the technology. In this case we show a paradox stating that the follower is unable to reach its original upper limit of the technological development could appear whenever the transfer rate is sufficiently high. Â We propose a new model to increase realism so that any technological transfer rate could only has a positive effect in accelerating the rate of growth of the follower in reaching its original upper limit of the development.DOI :Â http://dx.doi.org/10.22342/jims.22.1.212.37-59

ANTIMAGIC LABELING OF DIGRAPHS Moviri, Nalliah
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.216.61-69

AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of all arcs entering that vertex minus the sum of the labels of all arcs leaving it. A digraph D is called antimagic if it admits an antimagic labeling. In this paper we investigate the existence of antimagic labelings of some few families of digraphs using hooked Skolem sequences.DOI :Â http://dx.doi.org/10.22342/jims.22.1.216.61-69

MINIMUM COVERING SEIDEL ENERGY OF A GRAPH Kanna, Rajesh; R, Jagadeesh; Farahani, Mohammad Reza
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.234.71-82

In this paper we have computed minimum covering Seidel energies ofa star graph, complete graph, crown graph, complete bipartite graph and cocktailparty graphs. Upper and lower bounds for minimum covering Seidel energies of agraphs are also established.DOI :Â http://dx.doi.org/10.22342/jims.22.1.234.71-82

INSTABILITY OF CERTAIN NONLINEAR DIFFERENTIAL EQUATIONS OF FIFTH ORDER Tunc, Cemil; Ates, Muzaffer
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.249.83-91

This paper establishes certain sufficient conditions to guarantee the non-existence of periodic solutions for a class of nonlinear vector differential equations of fifth order. With this work, we extend and improve two related results in the literature from scalar cases to vectorial cases. An example is given to illustrate the theoretical analysis made in this paper.DOI :Â http://dx.doi.org/10.22342/jims.22.1.249.83-91

COMPLEMENTARY DISTANCE SPECTRA AND COMPLEMENTARY DISTANCE ENERGY OF LINE GRAPHS OF REGULAR GRAPHS Harishchandra S. Ramane; K.C. Nandeesh
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.205.27-35

The complementary distance (CD) matrix of a graph $G$ is defined as $CD(G) = [c_{ij}]$, where $c_{ij} = 1+D-d_{ij}$ if $i \neq j$ and $c_{ij} = 0$, otherwise, where $D$ is the diameter of $G$ and $d_{ij}$ is the distance between the vertices $v_i$ and $v_j$ in $G$. The $CD$-energy of $G$ is defined as the sum of the absolute values of the eigenvalues of $CD$-matrix. Two graphs are said to be $CD$-equienergetic if they have same $CD$-energy. In this paper we show that the complement of the line graph of certain regular graphs has exactly one positive $CD$-eigenvalue. Further we obtain the $CD$-energy of line graphs of certain regualr graphs and thus constructs pairs of $CD$-equienergetic graphs of same order and having different $CD$-eigenvalues.DOI : http://dx.doi.org/10.22342/jims.22.1.205.27-35

A DYNAMICAL SYSTEM APPROACH IN MODELING TECHNOLOGY TRANSFER Hennie Husniah; Sebrina Sebrina; A. K. Supriatna
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.212.37-59

In this paper we discuss a mathematical model of two parties technology transfer from a leader to a follower. The model is reconstructed via dynamical system approach from a known standard Raz and Assa model and we found some important conclusion which have not been discussed in the original model. The model assumes that in the absence of technology transfer from a leader to a follower, both the leader and the follower have a capability to grow independently with a known upper limit of the development. We obtain a rich mathematical structure of the steady state solution of the model. We discuss a special situation in which the upper limit of the technological development of the follower is higher than that of the leader, but the leader has started earlier than the follower in implementing the technology. In this case we show a paradox stating that the follower is unable to reach its original upper limit of the technological development could appear whenever the transfer rate is sufficiently high. We propose a new model to increase realism so that any technological transfer rate could only has a positive effect in accelerating the rate of growth of the follower in reaching its original upper limit of the development.DOI : http://dx.doi.org/10.22342/jims.22.1.212.37-59

ANTIMAGIC LABELING OF DIGRAPHS Nalliah Moviri
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.216.61-69

AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of all arcs entering that vertex minus the sum of the labels of all arcs leaving it. A digraph D is called antimagic if it admits an antimagic labeling. In this paper we investigate the existence of antimagic labelings of some few families of digraphs using hooked Skolem sequences.DOI : http://dx.doi.org/10.22342/jims.22.1.216.61-69

MINIMUM COVERING SEIDEL ENERGY OF A GRAPH Rajesh Kanna; Jagadeesh R; Mohammad Reza Farahani
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.22.1.234.71-82

In this paper we have computed minimum covering Seidel energies ofa star graph, complete graph, crown graph, complete bipartite graph and cocktailparty graphs. Upper and lower bounds for minimum covering Seidel energies of agraphs are also established.DOI : http://dx.doi.org/10.22342/jims.22.1.234.71-82

Home Page

OAI Link

Editorial Team

Contact

Reviewer

Google Scholar

Contact Name
-

Contact Email
-

Phone
-

Journal Mail Official
-

Editorial Address
-

Location
Kota bandung,

Jawa barat

INDONESIA

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Home Page

OAI Link

Editorial Team

Contact

Reviewer

Google Scholar

Contact Name -

Contact Email -

Phone -

Journal Mail Official -

Editorial Address -

Location Kota bandung, Jawa barat INDONESIA

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Contact Name
-

Contact Email
-

Phone
-

Journal Mail Official
-

Editorial Address
-

Location
Kota bandung,

Jawa barat

INDONESIA